Computation of Discrete Logarithms in F2607
نویسنده
چکیده
We describe in this article how we have been able to extend the record for computations of discrete logarithms in characteristic 2 from the previous record over F2503 to a newer mark of F2607 , using Coppersmith’s algorithm. This has been made possible by several practical improvements to the algorithm. Although the computations have been carried out on fairly standard hardware, our opinion is that we are nearing the current limits of the manageable sizes for this algorithm, and that going substantially further will require deeper improvements to the method.
منابع مشابه
Algorithmes de calcul de logarithmes discrets dans les corps finis
Computing discrete logarithms is a fundamental task for public key cryptanalysis. Themere existence of a subexponential algorithm for this purpose is not sufficient to definitely ruleon the security level provided by some cryptosystem. Assessing state-of-the-art cryptanalysiscalls for a thorough evaluation process. This dissertation contributes to such an evaluation.In particula...
متن کامل- 1 - Computation of Discrete Logarithms in PrimeFieldsB
The presumed diiculty of computing discrete logarithms in nite elds is the basis of several popular public key cryptosystems. The secure identiication option of the Sun Network File System, for example, uses discrete logarithms in a eld GF(p) with p a prime of 192 bits. This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as th...
متن کاملDiscrete Logarithms: Recent Progress
We summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically , we consider the following abelian groups: the multiplicative group of nite elds, the group of points of an elliptic curve over a nite eld, and the class group of quadratic number elds.
متن کاملComputing small discrete logarithms using optimized lookup tables
In our previous work Crux , we used an additively homomorphic elliptic-curve cryptosystem, based on El Gamal, to compute privacy-preserving statistics for the Tor network [4]. The decryption algorithm of our cryptographic scheme required the computation of a small discrete logarithm (DL). For small values, the computation of the DLP should have been trivial as an exhaustive search would quickly...
متن کاملMassively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith’s algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001